Pushdown Processes: Parallel Composition and Model Checking
نویسندگان
چکیده
In this paper we consider a strict generalization of context-free processes, the pushdown processes, and show that this class of processes is 1) closed under parallel composition with nite state systems, and can 2) be model checked by means of an elegant adaptation of the higher order model checker introduced in BS92]. This shows the advantages of pushdown processes over context-free processes, which are not suuciently general in order to support parallel composition.
منابع مشابه
Decidability of model checking with the temporal logic EF
The branching-time temporal logic EF is a simple, but natural fragment of computation tree logic (CTL) and the modal-calculus. We study the decidability of the model checking problem for EF and innnite-state systems. We use process rewrite systems (PRS) to describe innnite-state systems and deene a hierarchy of subclasses of PRS that includes Petri nets, pushdown processes, Basic Parallel Proce...
متن کاملVeriication on Innnite Structures
In this chapter, we present a hierarchy of innnite-state systems based on the primitive operations of sequential and parallel composition; the hierarchy includes a variety of commonly-studied classes of systems such as context-free and pushdown automata, and Petri net processes. We then examine the equivalence and regularity checking problems for these classes, with special emphasis on bisimula...
متن کاملOn Simulation-Checking with Sequential Systems
We present new complexity results for simulation-checking and modelchecking with infinite-state systems generated by pushdown automata and their proper subclasses of one-counter automata and one-counter nets (one-counter nets are ‘weak’ one-counter automata computationally equivalent to Petri nets with at most one unbounded place). As for simulation-checking, we show the following: a) simulatio...
متن کاملThe complexity of model-checking of stateless probabilistic pushdown processes against PCTL
In this draft, we settle a problem in probabilistic verification of infinite–state processes (probabilistic pushdown systems). We show that model checking stateless probabilistic pushdown systems (pBPA) against probabilistic computational tree logic (PCTL) is undecidable.
متن کاملPushdown Processes: Games and Model Checking
A pushdown game is a two player perfect information infinite game on a transition graph of a pushdown automaton. A winning condition in such a game is defined in terms of states appearing infinitely often in the play. It is shown that if there is a winning strategy in a pushdown game then there is a winning strategy realized by a pushdown automaton. An EXPTIME procedure for finding a winner in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994